Simulating Dependencies to Improve Parse Error Detection
نویسندگان
چکیده
We improve parse error detection, weighting dependency information on the basis of simulated parses. Such simulations extend the training grammar, and, although the simulations are not wholly correct or incorrect—as observed from the results with different weightings for small treebanks—they help to determine whether a new parse fits the training grammar.
منابع مشابه
Cross-language Projection of Dependency Trees with Constrained Partial Parsing for Tree-to-Tree Machine Translation
Tree-to-tree machine translation (MT) that utilizes syntactic parse trees on both source and target sides suffers from the non-isomorphism of the parse trees due to parsing errors and the difference of annotation criterion between the two languages. In this paper, we present a method that projects dependency parse trees from the language side that has a high quality parser, to the side that has...
متن کاملA Global Joint Model for Semantic Role Labeling
We present a model for semantic role labeling that effectively captures the linguistic intuition that a semantic argument frame is a joint structure, with strong dependencies among the arguments. We show how to incorporate these strong dependencies in a statistical joint model with a rich set of features over multiple argument phrases. The proposed model substantially outperforms a similar stat...
متن کاملDeep Dependencies from Context-Free Statistical Parsers: Correcting the Surface Dependency Approximation
We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based on loglinear classifiers to augment and reshape context-free trees so as to reintroduce underlying nonlocal dependencies lost in the context-free approximation. We find that our algorithm compares favorably with prior...
متن کاملDescriptive and Empirical Approaches to Capturing Underlying Dependencies among Parsing Errors
In this paper, we provide descriptive and empirical approaches to effectively extracting underlying dependencies among parsing errors. In the descriptive approach, we define some combinations of error patterns and extract them from given errors. In the empirical approach, on the other hand, we re-parse a sentence with a target error corrected and observe errors corrected together. Experiments o...
متن کاملGrammar Error Detection with Best Approximated Parse
In this paper, we propose that grammar error detection be disambiguated in generating the connected parse(s) of optimal merit for the full input utterance, in overcoming the cheapest error. The detected error(s) are described as violated grammatical constraints in a framework for ModelTheoretic Syntax (MTS). We present a parsing algorithm for MTS, which only relies on a grammar of well-formedne...
متن کامل